Strong and Semi Strong Outer Mod Sum Graphs
نویسندگان
چکیده
A semi strong outer mod sum labeling of a graph G is an injective mapping f : V (G) → Z+ with an additional property that for each vertex v of G, there exist vertices w1, w2 in V (G) such that f(w1) = ∑ u∈N(v) f(u) and f(v) = ∑ u∈N(w2) f(u), where both the sums are taken under addition modulo m for some positive integer m. A graph G which admits a semi strong outer mod sum labeling is called a semi strong outer mod sum graph. In this paper we show that the Paths Pn for all n = 3, the Cycle C6, and the Complete graphs Kn for all n = 3 are semi strong outer mod sum graphs. Mathematics Subject Classification: 05C78, 05C12, 05C15
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملMod sum graph labelling of Hm, n and Kn
The mod sum number p( G) of a connected graph G is the minimum number of isolated vertices required to transform G into a mod sum graph. It is known that the mod sum number is greater than zero for wheels, Wn, when n > 4 and for the complete graphs, Kn when n 2: 2. In this paper we show that p( Hm,n) > 0 for n > m ;::: 3. Vie show further that P(K2) = P(K3) = 1 while p(Kn) = n for n ;::: 4. We ...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملStrong Dominating - Color Number on Sum and Cartesian Product of Graphs
Let G = (V, E) be a graph. We define strong dominating color number of a graph G as the maximum number of color classes which are strong dominating sets of G, and is denoted by sd(G) , where the maximum is taken over all -coloring of G. This paper determines the exact values of strong dominating color number of sum and Cartesian product of graphs.
متن کاملAn Upper Bound of the Basis Number of the Semi-strong Product of Cycles with Bipartite Graphs
An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs is given. Also, an example is presented where the bound is achieved.
متن کامل